Routing-Oblivious Network-Wide Measurements

نویسندگان

چکیده

The recent introduction of SDN allows deploying new centralized network algorithms that dramatically improve operations. In such algorithms, the controller obtains a network-wide view by merging measurement data from Network Measurement Points (NMPs). A fundamental challenge is several NMPs may count same packet, reducing accuracy measurement. Existing solutions circumvent this problem assuming each packet traverses single NMP or routing fixed and known. This work suggests novel for three problems without making any assumptions on topology modifying underlying traffic. Specifically, introduces two estimating number (distinct) packets byte volume in measurement, per-flow counts, finding heavy hitter flows. Our includes formal guarantees an extensive evaluation consisting realistic fat-tree real traces. shows our outperform existing works provide accurate measurements within reasonable space parameters.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Oblivious Routing for Sensor Network Topologies

We present oblivious routing algorithms whose routing paths are constructed independent of each other, with no dependence on the routing history. Oblivious algorithms are inherently adaptive to dynamic packet traffic, exhibit low congestion, and require low maintenance. All these attributes make oblivious algorithms to be suitable for sensor networks which are characterized by their limited ene...

متن کامل

Traffic Oblivious Routing

The objective of the book is to describe recent developments in oblivious routing. There are two broad methodologies for routing network traffic in an oblivious manner without detailed knowledge of the traffic matrix. Both these approaches will be covered in the book. The first is Direct Routing which routes packets along fixed paths, from ingress to egress, that are picked to optimize some obj...

متن کامل

3 Oblivious Routing Schemes

where P̂ is a linear projection onto the space of circulations, i.e., of all the flows f with Bf = 0, and ĥ is some fixed unit s-t flow. As we showed last time, once we construct a projection P (·) then we obtain an (1 − ε)-approximate maximum flow algorithm whose performance is described in the following theorem. Theorem 1 If P (·) is an α-approximate affine `∞-projection P (·) onto the space F...

متن کامل

Oblivious Routing via Random Walks

We present novel oblivious routing algorithms for both splittable and unsplittable multicommodity flow. Our algorithm for minimizing congestion for unsplittable multicommodity flow is the first oblivious routing algorithm for this setting. As an intermediate step towards this algorithm, we present a novel generalization of Valiant’s classical load balancing scheme for packet-switched networks t...

متن کامل

Selfish Routing with Oblivious Users

We consider the problem of characterizing user equilibria and optimal solutions for selfish routing in a given network. We extend the known models by considering users oblivious to congestion. While in the typical selfish routing setting the users follow a strategy that minimizes their individual cost by taking into account the (dynamic) congestion due to the current routing pattern, an oblivio...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE ACM Transactions on Networking

سال: 2021

ISSN: ['1063-6692', '1558-2566']

DOI: https://doi.org/10.1109/tnet.2021.3061737